Description: 用势场法的原理实现的vc搜索最短路径程序，改进后的势场法，实用。-with potential field of realization of the principle of shortest path vc search procedures, improving the potential field and practical. Platform: |
Size: 58368 |
Author:安黎 |
Hits:
Description: 深度搜索算法，求解从起源点s到点j的最短路径算法的基本过程-depth search algorithm, solved from the point of origin j s close of the shortest path algorithm for the basic process Platform: |
Size: 3072 |
Author:Bill |
Hits:
Description: RBFS算法（递归最佳优先搜索：A*家族）和LRTA*算法（联机局部搜索，又名实时学习A*搜索，同为A*家族）实现图的单源最短路径。其中RBFS和LRTA*算法均比狄杰算法效率高！
-RBFS algorithm (recursive best first search :* A family) and the LRTA* algorithm (online local search, also known as real-time learning A* search, with the A* family) plans to achieve a single source shortest path. Which RBFS and LRTA* Algorithm than Dilger efficient algorithm! Platform: |
Size: 19456 |
Author:陈名 |
Hits:
Description: this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value -this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter, value Platform: |
Size: 4096 |
Author:宏姬 |
Hits:
Description: 用图形用户界面表示的图，数据结构基本应用，最小生成树算法，最短路径，广度、深度优先搜索-graphical user interface with the plan said, the basic data structure application, the minimum spanning tree algorithm, the shortest path, breadth, depth-first search Platform: |
Size: 61440 |
Author:张旭 |
Hits:
Description: 我编写的几个图论代码，包括深搜、最小生成树、最短路径，注释我写的很详细，大家可以作为入门参考。-I prepared a number of graph theory code, including deep search, minimum spanning tree, shortest path, notes I wrote in great detail, we can serve as a reference entry. Platform: |
Size: 3072 |
Author:彭立勋 |
Hits:
Description: Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Platform: |
Size: 3072 |
Author:阳关 |
Hits:
Description: 二叉树的遍历、线索化、遍历线索化二叉树等算法；深度搜索优先、广度搜索优先算法，
最小生成树、最短路算法。-Binary tree traversal, threaded, threaded binary tree traversal algorithms, such as the depth of the search priority, breadth of search priority algorithm, minimum spanning tree, shortest path algorithm. Platform: |
Size: 314368 |
Author:刘飞 |
Hits:
Description: kruskal算法，实现图的遍历最短路径查找，本人的算法设计的一次实验。-Kruskal algorithm, to achieve the shortest path graph traversal search, the algorithm I designed an experiment. Platform: |
Size: 231424 |
Author:moxianwen |
Hits:
Description: 根据城市交通路网建设的实际, 研究了描述城市交通网络图的城市道路数据库的组织结构, 在此数据
结构的基础上依靠G IS 技术的支持, 采集了大量具体道路信息, 采用D ijk st ra 算法实现了快速最短路径搜索。根
据城市的交通状况对交通网络图的边值赋予不同的权值可实现最优路径搜寻, 给出了一个搜索实例——一个包
含61 个交通路口的最短路径搜索结果的搜索时间约为1. 1-Urban traffic network in accordance with the actual building, research describing the urban traffic of the urban road network structure of the database, in this data structure based on G IS techniques rely on the support, collecting a large number of specific road information, the use of D ijk st ra algorithm to achieve a fast shortest path search. According to city traffic conditions on the transport network map boundary value given different weights to achieve optimal path search, a search examples are given- one that contains 61 traffic junctions of the shortest path search results of the search time is about 1. 1 Platform: |
Size: 183296 |
Author:王功臣 |
Hits:
Description: 本文提出了一种基于矢量角度的最短路径搜索算法，设计出一种类似于面向对象的数据存储结构来存储网络图中的节点及弧段对象，在最短路径的搜索上引入矢量夹角标量值做为搜索因子，充分利用了网络图中各点元素和线元素间的拓扑关系，提高了搜索的趋势性，同时还考虑了各弧段的长度值（或权值），较好的将网络图中对象的空间信息和属性信息相结合-In this paper, a vector-based perspective of the shortest path search algorithm to design a similar object-oriented data storage structure to store the network diagram of nodes and arcs object, in the shortest path search on the introduction of the vector angle between the scalar value as a search factor, make full use of the network elements in the points and lines of topological relations between elements to enhance the search trends, while also taking into account the arc length of the value (or weight), good will network map object spatial information and attribute information to combine Platform: |
Size: 33792 |
Author:zh |
Hits:
Description: 图的算法的基本训练
1、 图的存储结构的定义和图的创建
图的种类有：有向图、无向图、有向网、无向网。
图的存储结构可采用：邻接矩阵、邻接表。
要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法
2、 图的遍历：非递归的深度优先搜索算法、广度优先搜索算法。
3、 图的深度遍历的应用：求无向连通图中的关节点（教材P177-178,算法7.10和7.11）
4、 图的广度遍历的应用：给定图G，输出从顶点v0到其余每个顶点的最短路径，要求输出各路径中的顶点信息。
-Map of the basic training algorithm 1 and the storage structure of the definition and plans to create the types of plans are: directed graph, undirected graph, to the network, no to the network. Map storage structure can be: adjacency matrix, the adjacent table. Requirements: adjacency matrix is given, respectively, and adjacent table in a certain kind of map creation algorithm 2, graph traversal: Non-recursive depth-first search algorithm, breadth-first search algorithm. 3, graph traversal depth of applications: for Undirected connected graph of the key points (teaching P177-178, Algorithm 7.10 and 7.11) 4, Fig traverse the breadth of applications: a given graph G, the output from the vertex v0 to The rest of each vertex of the shortest path, the path of the output requirements of the vertex information. Platform: |
Size: 7168 |
Author:bueaty |
Hits:
Description: Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。
-Dijkstra algorithm is a typical example of the most short-circuit algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the date extended to the end. Dijkstra shortest path algorithm can arrive at the optimal solution, but because it traverse a lot of computing nodes, so inefficient. Dijkstra algorithm is a step by step search algorithm for each vertex n reservations so far found from the m to n shortest path to work. Platform: |
Size: 1024 |
Author:kivilin |
Hits:
Description: 内容为一doc文档，主要实现了地铁站公交系统的自动售票以及管理功能，涉及到了最短路径的求法，以及sql方面的检索技术。-Content of a doc document, the main bus station realized the automatic ticketing system, and management functions related to the shortest path seeking method, as well as the sql in search technology. Platform: |
Size: 108544 |
Author:余鹏 |
Hits:
Description: 算法简述：A星路径搜索(采用二叉堆)，最短路径寻路算法-Algorithm Description: A star path search (using the binary heap), the shortest path Algorithm for Route Platform: |
Size: 51200 |
Author:zhongkeli |
Hits:
Description: 本文件里描述了用蚁群算法寻找最短路径的方法，以及相应的搜索路线图形表示-This document describes the use of ant colony algorithm to find the shortest path method, and the corresponding graphical representation of the search line Platform: |
Size: 91136 |
Author:加俊 |
Hits:
Search - search shortest path